Fast pattern matching method for a bitstream
نویسندگان
چکیده
منابع مشابه
A FAST Pattern Matching Algorithm
The advent of digital computers has made the routine use of pattern-matching possible in various applications. This has also stimulated the development of many algorithms. In this paper, we propose a new algorithm that offers improved performance compared to those reported in the literature so far. The new algorithm has been evolved after analyzing the well-known algorithms such as Boyer-Moore,...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملA Fast Matching Method for Color
In this paper we present a new method for point matching in stereoscopic color images. Our approach consists rst in characterizing points of interest using di erential invariants. Then we de ne additional rst order invariants using color information, which make suÆcient the characterization till rst order. In addition, we make our description robust to important image transformations like rotat...
متن کاملFast Pattern Matching for Entropy Bounded Text
We present the rst known case of one-dimensional and two-dimensional string matching algorithms for text with bounded entropy. Let n be the length of the text and m be the length of the pattern. We show that the expected complexity of the algorithms is related to the entropy of the text for various assumptions of the distribution of the pattern. For the case of uniformly distributed patterns, o...
متن کاملA Fast Stereo Matching Method
Stereo matching is important in the area of computer vision and photogrammetry. This paper presents a fast stereo matching algorithm which produces a dense disparity map by using a pyramid structure, fast correlation and dynamic programming techniques. Fast correlation is achieved by using the box filtering technique which is invariant to the size of the correlation window. The disparity for ea...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of Taras Shevchenko National University of Kyiv. Series: Physics and Mathematics
سال: 2020
ISSN: 2218-2055,1812-5409
DOI: 10.17721/1812-5409.2020/4.5